Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algori...(展开全部)

Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algori...(展开全部)

'This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessibl...(展开全部)

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate ...(展开全部)

Alfred V．Aho 博士是哥伦比亚大学计算机科学系主管本科生教学的副主任，IEEE Fellow，美国科学与艺术学院及国家工程学院院士，曾获得IEEE的冯·诺伊曼奖。他是《编译原理》(Compiler：Principles，Techniques，andTools)的第一作者。 他目前的研究方向为量子计算、程式设计语言．编译器和算法等。 John E．Hppcroft 博士是康奈尔大学工程学院院长兼计算机科学系教授，IEEE Fellow，美国科学与艺术学院及国家工程学院院士，1986年因其在数据结构、算法设计与分析等领域的重要贡献而获得图灵奖。他还是《自动机理论，语言和计算导论》(Introduction to Antomata Theory，Languages，and Computation)的第一作者。他目前的研究方向是信息存取。 Jefi...(展开全部)

Alfred V．Aho 博士是哥伦比亚大学计算机科学系主管本科生教学的副主任，IEEE Fellow，美国科学与艺术学院及国家工程学院院士，曾获得IEEE的冯·诺伊曼奖。他是《编译原理》(Compiler：Principles，Techniques，andTools)的第一作者。 他目前的研究方向为量子计算、程式设计语言．编译器和算法等。 John E．Hppcroft 博士是康奈尔大学工程学院院长兼计算机科学系教授，IEEE Fellow，美国科学与艺术学院及国家工程学院院士，1986年因其在数据结构、算法设计与分析等领域的重要贡献而获得图灵奖。他还是《自动机理论，语言和计算导论》(Introduction to Antomata Theory，Languages，and Computation)的第一作者。他目前的研究方向是信息存取。 Jefi...(展开全部)

Based on a Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, "Introduction to the Design and Analysis of Algorithms" presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the m...(展开全部)

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material r...(展开全部)

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The ...(展开全部)